#ifndef WEIGHTED_DIRECTED_GRAPH_H
#define WEIGHTED_DIRECTED_GRAPH_H

#include <ctime>
#include <vector>
#include <iostream>
#include "Weighted_Directed_Graph.hpp"

using namespace std;

typedef struct vertex
{
    int index;
    vertex* next;

    //Bellman Algorithm Use
    int d;
    vertex* pi;
}vertex;

class  Weight_Directed_Graph
{
private:

public:
    vector<vertex*> V;
    //vector<vector<int>> E;
    int n_V;
    bool need_free_memory = true;
     Weight_Directed_Graph(vector<vector<int>> e);
     Weight_Directed_Graph(vector<vertex* > V);
    ~ Weight_Directed_Graph();
};

#endif